Confluent Rewriting systems in Non-Monotonic Reasoning
نویسندگان
چکیده
Non-profit academic project, developed under the open access initiative
منابع مشابه
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent
This paper shows that weakly-non-overlapping, non-collapsing and shallow term rewriting systems are confluent, which is a new sufficient condition on confluence for non-left-linear systems.
متن کاملLogic Based Programmed Structure Rewriting Systems 1
This paper presents a new logic based framework for the formal treatment of graph rewriting systems as special cases of programmed rewriting systems for arbitrary relational structures. Considering its expressive power, the new formalism surpasses almost all variants of nonparallel algebraic as well as algorithmic graph grammar approaches by offering set-oriented pattern matching facilities as ...
متن کاملA Taxonomy for Argumentative Frameworks based on Labelled Deduction
Artificial Intelligence has long dealt with the issue of finding a suitable formalization for reasoning with incomplete and potentially inconsistent information. Defeasible argumentation [SL92,CML00,PraVre99] has proven to be a successful approach in many respects, since it naturally resembles many aspects of commonsense reasoning (see [CML00,PraVre99] for details). Besides, recent work [PraVre...
متن کاملNon-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent
A term is weakly shallow if each defined function symbol occurs either at the root or in the ground subterms, and a term rewriting system is weakly shallow if both sides of a rewrite rule are weakly shallow. This paper proves that non-E-overlapping, weakly-shallow, and noncollapsing term rewriting systems are confluent by extending reduction graph techniques in our previous work [SO10] with tow...
متن کاملConfluent Term-Graph Reduction for Computer-Aided Formal Reasoning
Sparkle is the dedicated proof assistant for the lazy functional programming language Clean, which is based on term-graph rewriting. Because equational reasoning is an important proof technique, Sparkle needs to offer support for formally proving e1 = e2 in as many situations as possible. The base proof of equality is by means of reduction: if e1 reduces to e2, then also e1 = e2. Therefore, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computación y Sistemas
دوره 2 شماره
صفحات -
تاریخ انتشار 1999